Potentially nilpotent patterns and the Nilpotent-Jacobian method

Generating potentially nilpotent full sign patterns

A sign pattern is a matrix with entries in {+,−, 0}. A full sign pattern has no zero entries. The refined inertia of a matrix pattern is defined and techniques are developed for constructing potentially nilpotent full sign patterns. Such patterns are spectrally arbitrary. These techniques can also be used to construct potentially nilpotent sign patterns that are not full, as well as potentially...

Jacobian Conjecture and Nilpotent Mappings

We prove the equivalence of the Jacobian Conjecture (JC(n)) and the Conjecture on the cardinality of the set of fixed points of a polynomial nilpotent mapping (JN(n)) and prove a series of assertions confirming JN(n).

Nilpotent Symmetric Jacobian Matrices and the Jacobian Conjecture Ii

It is shown that the Jacobian Conjecture holds for all polynomial maps F : k → k of the form F = x + H , such that JH is nilpotent and symmetric, when n ≤ 4. If H is also homogeneous a similar result is proved for all n ≤ 5. Introduction Let F := (F1, . . . , Fn) : C → C be a polynomial map i.e. each Fi is a polynomial in n variables over C. Denote by JF := (i ∂xj )1≤i,j≤n, the Jacobian matrix ...

Hessian Nilpotent Polynomials and the Jacobian Conjecture

Let z = (z1, · · · , zn) and ∆ = ∑n i=1 ∂ 2 ∂z i the Laplace operator. The main goal of the paper is to show that the wellknown Jacobian conjecture without any additional conditions is equivalent to the following what we call vanishing conjecture: for any homogeneous polynomial P (z) of degree d = 4, if ∆P(z) = 0 for all m ≥ 1, then ∆P(z) = 0 when m >> 0, or equivalently, ∆P(z) = 0 when m > 3 2...

Potentially nilpotent tridiagonal sign patterns of order 4